#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
struct S
{
	int x, h;
	double z;
}s[N];
int n;
int cmp(S a, S b)
{
	return a.x > b.x;
}
double cal(S a)
{
	return a.x - a.h * y / x;
}
int main()
{
	while (cin >> n) {
		for (int i = 0; i < n; i++) {
			cin >> s[i].x >> s[i].h;
			s[i].x *= -1;
		}
		sort(s, s + n,cmp);
		int ans = 1;
		double temp = cal(s[0]);
		for (int i = 1; i < n; i++) {
			if (cal(s[i]) < temp) {
				ans++;
			}
			temp = min(temp, cal(s[i]));
		}
		cout << n - ans << endl;
	}
	return 0;
}